Ta-Shma, Amnon: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

1

On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace

Doron, Dean, Sarid, Amir, Ta-Shma, Amnon

Journal:

Computational Complexity

Year:

2017

Language:

english

File:

PDF, 404 KB

english, 2017

2

Extractors from Reed–Muller codes

Amnon Ta-Shma, David Zuckerman, Shmuel Safra

Journal:

Journal of Computer and System Sciences

Year:

2006

Language:

english

File:

PDF, 276 KB

english, 2006

3

Short Seed Extractors against Quantum Storage

Journal:

SIAM Journal on Computing

Year:

2011

Language:

english

File:

PDF, 246 KB

english, 2011

4

The Quantum Communication Complexity of Sampling

Ambainis, Andris, Schulman, Leonard J., Ta-Shma, Amnon, Vazirani, Umesh, Wigderson, Avi

Journal:

SIAM Journal on Computing

Year:

2003

Language:

english

File:

PDF, 219 KB

english, 2003

5

[IEEE 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) - Berkeley, CA, USA (2006.10.21-2006.10.24)] 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) - Better lossless condensers through derandomized curve samplers

Ta-Shma, Amnon, Umans, Christopher

Year:

2006

Language:

english

File:

PDF, 200 KB

english, 2006

6

[ACM Press the thirty-second annual ACM symposium - Portland, Oregon, United States (2000.05.21-2000.05.23)] Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00 - Normal subgroup reconstruction and quantum computation using group representations

Hallgren, Sean, Russell, Alexander, Ta-Shma, Amnon

Year:

2000

Language:

english

File:

PDF, 814 KB

english, 2000

7

Extracting Randomness: A Survey and New Constructions

Noam Nisan, Amnon Ta-Shma

Journal:

Journal of Computer and System Sciences

Year:

1999

Language:

english

File:

PDF, 351 KB

english, 1999

8

Better short-seed quantum-proof extractors

Avraham Ben-Aroya, Amnon Ta-Shma

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 244 KB

english, 2012

9

[ACM Press the 41st annual ACM symposium - Bethesda, MD, USA (2009.05.31-2009.06.02)] Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09 - Short seed extractors against quantum storage

Year:

2009

Language:

english

File:

PDF, 499 KB

english, 2009

10

[ACM Press the thirtieth annual ACM symposium - Dallas, Texas, United States (1998.05.24-1998.05.26)] Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 - Almost optimal dispersers

Year:

1998

Language:

english

File:

PDF, 797 KB

english, 1998

11

Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators

Radhakrishnan, Jaikumar, Ta-Shma, Amnon

Journal:

SIAM Journal on Discrete Mathematics

Year:

2000

Language:

english

File:

PDF, 434 KB

english, 2000

12

Provable Unlinkability Against Traffic Analysis with Low Message Overhead

Berman, Ron, Fiat, Amos, Gomułkiewicz, Marcin, Klonowski, Marek, Kutyłowski, Mirosław, Levinboim, Tomer, Ta-Shma, Amnon

Journal:

Journal of Cryptology

Year:

2015

Language:

english

File:

PDF, 308 KB

english, 2015

13

Improving the Alphabet-Size in Expander-Based Code Constructions

Rom, E., Amnon Ta-Shma

Journal:

IEEE Transactions on Information Theory

Year:

2006

Language:

english

File:

PDF, 324 KB

english, 2006

14

On the de-randomization of space-bounded approximate counting problems

Doron, Dean, Ta-Shma, Amnon

Journal:

Information Processing Letters

Year:

2015

Language:

english

File:

PDF, 230 KB

english, 2015

15

[ACM Press the 49th Annual ACM SIGACT Symposium - Montreal, Canada (2017.06.19-2017.06.23)] Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 - An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy

Ben-Aroya, Avraham, Doron, Dean, Ta-Shma, Amnon

Year:

2017

Language:

english

File:

PDF, 820 KB

english, 2017

16

Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences

Ta-Shma, Amnon, Zwick, Uri

Journal:

ACM Transactions on Algorithms

Year:

2014

Language:

english

File:

PDF, 290 KB

english, 2014

17

Non-interactive Timestamping in the Bounded-Storage Model

Tal Moran, Ronen Shaltiel, Amnon Ta-Shma

Journal:

Journal of Cryptology

Year:

2009

Language:

english

File:

PDF, 482 KB

english, 2009

18

[IEEE 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS) - Las Vegas, NV, USA (2010.10.23-2010.10.26)] 2010 IEEE 51st Annual Symposium on Foundations of Computer Science - Local List Decoding with a Constant Number of Queries

Ben-Aroya, Avraham, Efremenko, Klim, Ta-Shma, Amnon

Year:

2010

Language:

english

File:

PDF, 363 KB

english, 2010

19

On the Power of Quantum, One Round, Two Prover Interactive Proof Systems

Alex Rapaport, Amnon Ta-Shma

Journal:

Quantum Information Processing

Year:

2007

Language:

english

File:

PDF, 167 KB

english, 2007

20

Uniform hardness versus randomness tradeoffs for Arthur-Merlin games

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma

Journal:

Computational Complexity

Year:

2003

Language:

english

File:

PDF, 441 KB

english, 2003

21

A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product

Ben-Aroya, Avraham, Ta-Shma, Amnon

Journal:

SIAM Journal on Computing

Year:

2011

Language:

english

File:

PDF, 348 KB

english, 2011

22

[ACM Press the thirty-second annual ACM symposium - Portland, Oregon, United States (2000.05.21-2000.05.23)] Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00 - Quantum bit escrow

Aharonov, Dorit, Ta-Shma, Amnon, Vazirani, Umesh V., Yao, Andrew C.

Year:

2000

Language:

english

File:

PDF, 898 KB

english, 2000

23

A note on PCP vs. MIP

Journal:

Information Processing Letters

Year:

1996

Language:

english

File:

PDF, 545 KB

english, 1996

24

Storing information with extractors

Journal:

Information Processing Letters

Year:

2002

Language:

english

File:

PDF, 110 KB

english, 2002

25

Dense quantum coding and quantum finite automata

Ambainis, Andris, Nayak, Ashwin, Ta-Shma, Amnon, Vazirani, Umesh

Journal:

Journal of the ACM

Year:

2002

Language:

english

File:

PDF, 162 KB

english, 2002

26

[IEEE 2008 23rd Annual IEEE Conference on Computational Complexity - College Park, MD, USA (2008.06.23-2008.06.26)] 2008 23rd Annual IEEE Conference on Computational Complexity - Quantum Expanders: Motivation and Constructions

Ben-Aroya, Avraham, Schwartz, Oded, Ta-Shma, Amnon

Year:

2008

Language:

english

File:

PDF, 436 KB

english, 2008

27

[ACM Press the 45th annual ACM symposium - Palo Alto, California, USA (2013.06.01-2013.06.04)] Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 - Inverting well conditioned matrices in quantum logspace

Year:

2013

Language:

english

File:

PDF, 620 KB

english, 2013

28

Lossless Condensers, Unbalanced Expanders, And Extractors

Amnon Ta-Shma*, Christopher Umans†, David Zuckerman‡

Journal:

Year:

2007

Language:

english

File:

PDF, 386 KB

english, 2007

29

Almost Optimal Dispersers

Journal:

Year:

2002

Language:

english

File:

PDF, 306 KB

english, 2002

30

An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs

Armoni, Roy, Ta-Shma, Amnon, Widgerson, Avi, Zhou, Shiyu

Journal:

Journal of the ACM

Year:

2000

Language:

english

File:

PDF, 164 KB

english, 2000

31

[ACM Press the thirty-third annual ACM symposium - Hersonissos, Greece (2001..-..)] Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 - Loss-less condensers, unbalanced expanders, and extractors

Ta-Shma, Amnon, Umans, Christopher, Zuckerman, David

Year:

2001

Language:

english

File:

PDF, 280 KB

english, 2001

32

If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma

Journal:

Computational Complexity

Year:

2007

Language:

english

File:

PDF, 317 KB

english, 2007

33

[IEEE 2012 IEEE Conference on Computational Complexity (CCC) - Porto, Portugal (2012.06.26-2012.06.29)] 2012 IEEE 27th Conference on Computational Complexity - Better Condensers and New Extractors from Parvaresh-Vardy Codes

Ta-Shma, Amnon, Umans, Christopher

Year:

2012

Language:

english

File:

PDF, 228 KB

english, 2012

34

[ACM Press the thirty-fifth ACM symposium - San Diego, CA, USA (2003.06.09-2003.06.11)] Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 - Adiabatic quantum state generation and statistical zero knowledge

Aharonov, Dorit, Ta-Shma, Amnon

Year:

2003

Language:

english

File:

PDF, 268 KB

english, 2003

35

[ACM Press the twenty-ninth annual ACM symposium - El Paso, Texas, United States (1997.05.04-1997.05.06)] Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 - SL ⊆ L 4/3

Armoni, Roy, Ta-Shma, Amnon, Wigderson, Avi, Zhou, Shiyu

Year:

1997

Language:

english

File:

PDF, 1.35 MB

english, 1997

36

[ACM Press the twenty-eighth annual ACM symposium - Philadelphia, Pennsylvania, United States (1996.05.22-1996.05.24)] Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 - On extracting randomness from weak random sources (extended abstract)

Year:

1996

Language:

english

File:

PDF, 810 KB

english, 1996

37

[ACM Press the thirty-third annual ACM symposium - Hersonissos, Greece (2001..-..)] Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 - Extractor codes

Ta-Shma, Amnon, Zucherman, David

Year:

2001

Language:

english

File:

PDF, 241 KB

english, 2001

38

[IEEE 2009 IEEE 50th Annual Symposium on Foundations of Computer Science (FOCS) - Atlanta, GA, USA (2009.10.25-2009.10.27)] 2009 50th Annual IEEE Symposium on Foundations of Computer Science - Constructing Small-Bias Sets from Algebraic-Geometric Codes

Ben-Aroya, Avraham, Ta-Shma, Amnon

Year:

2009

Language:

english

File:

PDF, 231 KB

english, 2009

39

[ACM Press the 40th annual ACM symposium - Victoria, British Columbia, Canada (2008.05.17-2008.05.20)] Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08 - A combinatorial construction of almost-ramanujan graphs using the zig-zag product

Ben-Aroya, Avraham, Ta-Shma, Amnon

Year:

2008

Language:

english

File:

PDF, 298 KB

english, 2008

40

[ACM Press the twenty-seventh annual ACM symposium - Las Vegas, Nevada, United States (1995.05.29-1995.06.01)] Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 - Symmetric logspace is closed under complement

Nisan, Noam, Ta-Shma, Amnon

Year:

1995

Language:

english

File:

PDF, 421 KB

english, 1995

41

[ACM Press the 49th Annual ACM SIGACT Symposium - Montreal, Canada (2017.06.19-2017.06.23)] Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 - Explicit, almost optimal, epsilon-balanced codes

Year:

2017

Language:

english

File:

PDF, 767 KB

english, 2017

42

The Hidden Subgroup Problem and Quantum Computation Using Group Representations

Hallgren, Sean, Russell, Alexander, Ta-Shma, Amnon

Journal:

SIAM Journal on Computing

Year:

2003

Language:

english

File:

PDF, 224 KB

english, 2003

43

Limits of privacy amplification against nonsignaling memory attacks

Arnon-Friedman, Rotem, Ta-Shma, Amnon

Journal:

Physical Review A

Year:

2012

Language:

english

File:

PDF, 473 KB

english, 2012

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@1delivery.pm

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски